Tree Directed Grammars
نویسنده
چکیده
Within the natural language information system PLIDIS [6] a semantic processor was implemented for the translation of syntactically analyzed sentences into expressions of a predicate calculus-orlented internal representation language. This semantic processor was designed according to a translation grammar defined by Wulz [8], which is similar to the transformation grammar introduced by Chomsky [3]. The operations on trees which are defined in thetransformation grammar, i.e. deletion, insertion, and transposition of subtrees, are also available in the Wulz grammar. Therefore it can be assumed that it is equivalent to the transformation grammar with regard to the input/output-relation.
منابع مشابه
Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملPetri Net DAG Languages and Regular Tree Languages with Synchronization
A true-concurrency semantics is often given via pomsets. A pomset is an abstract directed acyclic graph that is in addition transitive: any grandson of a node is also a son of that node. We will drop this rather artificial transitive property in this paper and research abstract directed acyclic graphs (dags) as a true-concurrency semantics for Petri nets and their relation to regular languages ...
متن کاملXML tree structure compression using RePair
XML tree structures can conveniently be represented using ordered unranked trees. Due to the repetitiveness of XML markup these trees can be compressed effectively using dictionary-based methods, such as minimal directed acyclic graphs (DAGs) or straight-line context-free (SLCF) tree grammars. While minimal SLCF tree grammars are in general smaller than minimal DAGs, they cannot be computed in ...
متن کاملNCE Graph Grammars and Clique-Width
Graph grammars are widely used in order to deene classes of graphs having some inductive and narrow structure. In many cases the narrowness can be measured in terms of the maximal tree-width and/or clique-width of the graphs in the class, (see RS86],,CO00] for deenitions of these notions). It is known that using the corresponding tree-decomposition or clique-width parse term, any property of th...
متن کاملPreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملA method for analyzing the problem of determining the maximum common fragments of temporal directed tree, that do not change with time
In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1982